One-step Taylor–Galerkin methods for convection–diffusion problems
نویسندگان
چکیده
منابع مشابه
One-step Taylor–Galerkin methods for convection–diffusion problems
Third and fourth order Taylor–Galerkin schemes have shown to be efficient finite element schemes for the numerical simulation of time-dependent convective transport problems. By contrast, the application of higher-order Taylor–Galerkin schemes to mixed problems describing transient transport by both convection and diffusion appears to be much more difficult. In this paper we develop two new Tay...
متن کاملOne-Step Piecewise Polynomial Galerkin Methods for Initial Value Problems*
A new approach to the numerical solution of systems of first-order ordinary differential equations is given by finding local Galerkin approximations on each subinterval of a given mesh of size h. One step at a time, a piecewise polynomial, of degree n and class C°, is constructed, which yields an approximation of order 0(A*") at the mesh points and 0(A"+1) between mesh points. In addition, the ...
متن کاملImplicit One-step L-stable Generalized Hybrid Methods for the Numerical Solution of First Order Initial Value problems
In this paper, we introduce the new class of implicit L-stable generalized hybrid methods for the numerical solution of first order initial value problems. We generalize the hybrid methods with utilize ynv directly in the right hand side of classical hybrid methods. The numerical experimentation showed that our method is considerably more efficient compared to well known methods used for the n...
متن کاملTheory and Methods for One -step Odes
where f is continuous and outputs an Rd vector. approximation on grid functions Let y(t) be the true solution. LetH be the grid dened by step-sizes: h1 , . . . , hN such that 0 < t1 < . . . < tN satises t i = ∑ l=1 h i .1 Let ∣H∣ = maxi h i . 1 is is just the obvious grid where h i = t i − t i−1 . We are parameterizing it by the step-sizes h i instead of times because h is what shows up in th...
متن کاملBlock Implicit One - Step Methods
A class of one-step methods which obtain a block of r new values at each step are studied. The asymptotic behavior of both implicit and predictor-corrector procedures is examined.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2007
ISSN: 0377-0427
DOI: 10.1016/j.cam.2006.04.031